Online algorithm

Results: 302



#Item
21Online algorithms / Applied mathematics / Mathematics / Cache / Computer science / Analysis of algorithms / Virtual memory / Sorting algorithms / Cache algorithms / Competitive analysis / CPU cache / Algorithm

CS264: Beyond Worst-Case Analysis Lecture #3: Online Paging and Resource Augmentation∗ Tim Roughgarden† September 29,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-10-06 12:17:28
22Mathematics / Mathematical analysis / Theory of computation / Combinatorial optimization / Matching / Linear programming / Approximation algorithm / Permutation / Measure theory / operator

Online Bipartite Matching with Random Arrivals: An Approach Based on Strongly Factor-Revealing LPs ∗ Mohammad Mahdian

Add to Reading List

Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

Language: English - Date: 2012-07-04 18:28:36
23Cryptography / Initialization vector / Authenticated encryption / Stream cipher / Symmetric-key algorithm / Cipher / Chosen-plaintext attack / Advantage / Padding / Data Encryption Standard / Cryptographic nonce / Block cipher mode of operation

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance Viet Tung Hoang1,2 Reza Reyhanitabar3

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-26 02:21:29
24Computational complexity theory / Mathematics / Graph theory / Analysis of algorithms / Online algorithms / Edsger W. Dijkstra / Network theory / Probabilistic complexity theory / Randomized algorithm / Algorithm / Distributed computing / Shortest path problem

Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:00
25Statistics / Machine learning / Learning / Artificial intelligence / Statistical classification / Data mining / Concept drift / Massive Online Analysis / K-nearest neighbors algorithm / Support vector machine / Stochastic gradient descent / Batch processing

Batch-Incremental vs. Instance-Incremental Learning in Dynamic and Evolving Data Jesse Read1 , Albert Bifet2 , Bernhard Pfahringer2 , Geoff Holmes2 1 Department of Signal Theory and Communications

Add to Reading List

Source URL: users.ics.aalto.fi

Language: English - Date: 2012-10-25 03:54:39
26Mathematical optimization / Applied mathematics / Mathematics / Numerical analysis / Multi-objective optimization / Pareto efficiency / Genetic algorithm / Multidisciplinary design optimization / Evolutionary algorithm / Algorithm / MOEA Framework / Monte Carlo tree search

Online and Offline Learning in Multi-Objective Monte Carlo Tree Search Diego Perez, Spyridon Samothrakis and Simon Lucas School of Computer Science and Electronic Engineering University of Essex, Colchester CO4 3SQ, UK d

Add to Reading List

Source URL: eldar.mathstat.uoguelph.ca

Language: English - Date: 2016-07-12 12:05:04
27Operations research / Heuristics / Mathematics / Mathematical optimization / Cognition / Applied mathematics / Search algorithms / Hyper-heuristic / Travelling salesman problem / Genetic algorithm / Algorithm / Local search

What Works Best When? A Framework for Systematic Heuristic Evaluation Iain Dunning, Swati Gupta, John Silberholz Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139 , sw

Add to Reading List

Source URL: www.optimization-online.org

Language: English - Date: 2015-05-04 12:28:03
28Scheduling / Operations research / Mathematics / Applied mathematics / Computer science / Makespan / Online algorithm / Job / Competitive analysis / Algorithm / Optimization problem / Job shop scheduling

239 Documenta Math. Ronald Graham: Laying the Foundations of Online Optimization

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2012-07-25 10:25:05
29Analysis of algorithms / Online algorithms / Adversary model / Algorithm / Mathematics

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k + 1 by using one additional comparison

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-02 15:13:55
30Mathematics / Algorithm / Mathematical logic / Theoretical computer science / Mu / Greedy algorithm / Online algorithm / Discrete mathematics

Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness Submission to GECCO Track “Evolutionary Multiobjective Optimization (EMO)” ABSTRACT We study the convergence behavior of (µ + λ)-archiving a

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:34
UPDATE